Capacities of graphs and 2-matchings
نویسندگان
چکیده
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولSupereulerian graphs and matchings
A graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α(G) be the maximum number of independent edges in the graph G. In this paper, we show that if G is a 2-edge-connected simple graph and α(G) ≤ 2, then G is supereulerian if and only if G is not K2,t for some odd number t . © 2011 Elsevier Ltd. All rights reserved.
متن کاملPopular Matchings with Variable Job Capacities
We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. A matching M is popular if there is no matching M such that the number of people who prefer...
متن کاملSquare-Free 2-Matchings in Bipartite Graphs and Jump Systems
For an undirected graph and a fixed integer k, a 2-matching is said to be Ck-free if it has no cycle of length k or less. In particular, a C4-free 2-matching in a bipartite graph is called a square-free 2-matching. The problem of finding a maximum Ck-free 2-matching in a bipartite graph is NP-hard when k ≥ 6, and polynomially solvable when k = 4. Also, the problem of finding a maximum-weight Ck...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00188-x